Method for lighting- and view -angle-invariant face description with first- and second-order eigenfeatures

ABSTRACT

This invention provides a method to interpret and recognize huma faces. The 2 nd -order eigenfeatures are used for lighting-invariant face description and both the 1  st -order and 2 nd -order eigenfeatures are used for view-angle-invariant face description. After normalization and quantization, these features can describe face effectively and efficiently. In order to further reduce the size of face descriptor, variable length code can be used to encode the quantized eigenfeatures. This invention can be used in internet multimedia database retrieval, digital library, video editing, surveillance and tracking, and other applications using face recognition and verification.

BACKGROUND OF THE INVENTION

[0001] This invention relates to a method for lighting- and view-angle-invariant face description with first- and second-order eigenfeatures, and can be used in face description and recognition for content-based image retrieval, huma face identification and verification for bank, security system, and video phone, surveillance and tracking, digital library, and intemet multimedia database.

[0002] Human face perception is an active area in the computer vision community. Face recognition will play an important role in multimedia database search and many other applications. In recent years considerable progress has been made on the problems of face detection and recognition. Different specific techniques were proposed. Among these, neural nets, elastic template matching, Karhunen-Loeve expansion, algebraic moments and isodensity lines are typical methods.

[0003] Among these methods, Principal component analysis (PCA) or Karhunen-Loeve expansion is an important branch. Eigenface method is derived from PCA and it is convenient to be computed and has consistent accuracy in identification. Prior work showed that the PCA approach dissociates spontaneously between different types of information. The eigenvectors with large eigenvalues capture information that is common to subsets of faces and eigenvectors with small eigenvalues capture information specific to individual face. The studies show that only the information contained by the eigenvectors with large eigenvalues can be generalized to new faces that are not trained.

[0004] The advantage of eigenface method is that eigenvectors with large eigenvalues convey information relative to the basic shape and structure of the faces. That means features extracted from eigenvectors with large eigenvalues can be used to describe major characteristics of human faces. However, this is also the weakness of PCA. If we only consider the features extracted from eigenvectors with large eigenvalues, we cannot get the details of the faces which corresponds to individual faces. If these details of individual face can be described with the common features of human faces, the description of human faces can be more accurate.

[0005] Furthermore, it is difficult to get suitable eigenvectors to represent human faces if the face images are taken under different lighting conditions and different view-angles. According to our experience, the regular eigenface method is not excellent in recognizing faces under different lighting condition. However, many face images of the same person are taken under different lighting and view-angle conditions. The lighting-invariant and view-angle-invariant face description is still an important field to be explored.

SUMMARY OF THE INVENTION

[0006] Eigenface method is effective to extract common face characteristics such as shape and structure. In order to get details of faces that are lost when eigenvectors with small eigenvalues are truncated, the reconstructed faces with the features from eigenvectors with large eigenvalues should be obtained. With the reconstructed face images, the residue images between original images and reconstructed images can be obtained. These residue faces can be looked as high-passed face images which still contain rich detailed information for individual faces. In order to describe these residue faces, eigenface method can be used on these residue faces again. The obtained eigenvectors with large eigenvalues will reveal the common characteristics of residue faces. With this method, the second-order eigenvectors with large eigenvalues can be obtained to extract corresponding features. According to our experiments, first-order and second-order eigenfeatures are both effective for the view-angle-invariant face description, while the second-order eigenfeatures are also effective for the lighting-invariant face description. Therefore, the combination of first-order and second-order eigenfeatures can be used for view-angle-invariant face description and the second-order eigenfeatures can be used for lighting-invariant face description. Another way to describe face is to use first-order eigenfeatures exclusively. For lighting-invariant face description, only the eigenfeatures extracted from the eigenfaces with the top k-th to N-th largest eigenvalues (where O<k<N) to avoid the lighting variance coming from the top k eigenfaces with largest eigenvalues. The view-angle-invariant face features can be the eigenfeatures extracted from the eigenfaces corresponding to the top N largest eigenvalues.

[0007] Besides, when we consider face description, an important characteristic is symmetry of faces. The faces of most of the people are symmetric. Thus we can consider to use the left-right mirrored face image to represent the same person. Consequently the eigenfeatures of the original image and the mirrored image can both represent the same person. Therefore, we can use the linear combination of the eigenfeatures of the two images to represent the original image. In order to discriminate between the original image and the mirrored image, different weights can be used to combine the eigenfeatures.

[0008] The present invention provides two methods for lighting-invariant and view-angle-invariant human face description which can be used for image retrieval (query by face example), person identification and verification, surveillance and tracking, and other face recognition applications. In order to describe face characteristics, the concept of second-order eigenfaces is proposed according to our observation and derivation. At first, the first-order eigenfaces and second-order eigenfaces can be derived from a set of training face images. Then the eigenfaces can be adjusted with the characteristic of symmetry of faces. With these adjusted eigenfaces, the adjusted first-order and second-order eigenfeatures can be obtained. The combination of these eigenfeatures can be used to describe faces. With this description, Euclidean distance can be used for similarity measurement.

BRIEF DESCRIPTION OF THE DRAWINGS

[0009]FIG. 1 is a diagram for generating the light-invariant face descriptor.

[0010]FIG. 2 is a diagram for generating the view-angle-invariant face descriptor.

[0011]FIG. 3 shows the procedure to mirror an eigenface.

[0012]FIG. 4 shows the reconstructed faces, the corresponding original faces and the second -order residue images.

[0013]FIG. 5 shows the procedure for computing the first -order feature W⁽¹⁾

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

[0014] According to the present invention, first-order Eigenface and second-order Eigenface are obtained.

[0015] In FIG. 2, the face pictures 1 a, 2 a, 3 a, 4 a, 5 a and 6 a shown in the middle row are original face images captured by a digital camera without any particular processing. The face picture la can be expressed, by using one dimensional vector, as an original face image Φ₁. Similarly, face pictures 2 a, 3 a, 4 a, 5 a and 6 a can be expressed respectively, as original face images Φ₂ , Φ₃ , Φ₄ , Φ₅ , Φ₆. Generally, the original face image ia is expressed as Φ₁.

[0016] In the example shown in FIG. 2, when one dimensional vectors of the six original face images are added and the sum is divided by six, an average image Ψ is obtained, as given below.

Ψ=Φ₁+Φ₂+Φ₃+Φ₄+Φ₅+(Φ₆)/6

[0017] A difference between the one dimensional vector Φ₁ of the face picture 1 a and the average image Φ is expressed as Γ⁽¹⁾. A similar differences Γ₂ ⁽¹⁾, Γ₃ ⁽¹⁾, Γ₄ ⁽¹⁾, Γ₅ ⁽¹⁾Γ₆ ⁽¹⁾ can be obtained for other face pictures 2 a, 3 a, 4 a, 5 a and 6 a, respectively. Thus, the following equations are obtained.

Γ₁ ⁽¹⁾=Φ₁−Ψ

Γ₂ ⁽¹⁾=Φ₂−Ψ

Γ₃ ⁽¹⁾=Φ₃−Ψ

Γ₄ ⁽¹⁾=Φ₄−Ψ

Γ₅ ⁽¹⁾=Φ₅−Ψ

Γ₆ ⁽¹⁾=Φ₆−Ψ

[0018] As will be described later, the difference Γ₁ ⁽¹⁾ will be used as a base for obtaining the first-order feature component w₁ ⁽¹⁾ . Similarly, Γ₂ ⁽¹⁾, Γ₃ ⁽¹⁾, Γ₄ ⁽¹⁾, Γ₅ ⁽¹⁾, Γ₆ ⁽¹⁾ will be used as bases for obtaining the first-order feature components W₂ ⁽¹⁾, W₃ ⁽¹⁾ , w₄ ⁽¹⁾, w₅ ⁽¹⁾ and w₆ ⁽¹⁾. In these formulas, the superscript(1)indicates that the formulas are related to the first-order feature.

[0019] When the differences Γ₁ ⁽¹⁾, Γ₂ ⁽¹⁾, Γ₃ ⁽¹⁾, Γ₄ ⁽¹⁾, Γ₅ ⁽¹⁾, Γ₆ ⁽¹⁾ are processed in a low pass filter, reconstructed matrixes {circumflex over (Γ)}₁ ⁽¹⁾, {circumflex over (Γ)}₂ ⁽¹⁾, {circumflex over (Γ)}₃ ⁽¹⁾, {circumflex over (Γ)}₄ ⁽¹⁾, {circumflex over (Γ)}₅ ⁽¹⁾, and {circumflex over (Γ)}₆ ⁽¹⁾ are obtained.

[0020] In FIG. 2, the face pictures 1 b, 2 b, 3 b, 4 b, 5 b and 6 b shown in the top row are reconstructed face images obtained by adding the average image Ψ to each of the reconstructed matrixes {circumflex over (Γ)}₁ ⁽¹⁾, {circumflex over (Γ)}₂ ⁽¹⁾, {circumflex over (Γ)}₃ ⁽¹⁾, {circumflex over (Γ)}₄ ⁽¹⁾, {circumflex over (Γ)}₅ ⁽¹⁾and {circumflex over (Γ)}₆ ⁽¹⁾. The reconstructed face images 1 b, 2 b, 3 b, 4 b, 5 b and 6 b can be expressed as {circumflex over (Φ)}₁, {circumflex over (101 )}₂, {circumflex over (Φ)}₃, {circumflex over (Φ)}₄, {circumflex over (Φ)}₅, and {circumflex over (Φ)}₆ respectively, as given below.

{circumflex over (Φ)}₁=Ψ+{circumflex over (Γ)}₁ ⁽¹⁾

{circumflex over (Φ)}₂=Ψ+{circumflex over (Γ)}₂ ⁽¹⁾

{circumflex over (Φ)}₃=Ψ+{circumflex over (Γ)}₃ ⁽¹⁾

{circumflex over (Φ)}₄=Ψ+{circumflex over (Γ)}₄ ⁽¹⁾

{circumflex over (Φ)}₅=Ψ+{circumflex over (Γ)}₅ ⁽¹⁾

{circumflex over (Φ)}₆=Ψ+{circumflex over (Γ)}₆ ⁽¹⁾

[0021] Since the reconstructed face images contains data that have been processed in the low pass filter so that the high frequency information is removed, the face information will not vary even if the angle of the face should be changed slightly.

[0022] In FIG. 2, the face pictures 1 c, 2 c, 3 c, 4 c, 5 c and 6 c shown in the bottom row are residue images Γi ⁽²⁾, which are obtained by subtracting the reconstructed face images from the original face images. Thus, the following equations can be obtained.

Γ₁ ⁽²⁾=Φ₁−{circumflex over (Γ)}₁=Γ₁ ⁽¹⁾−{circumflex over (Γ)}₁ ⁽¹⁾

Γ₂ ⁽²⁾=Φ₂−{circumflex over (Γ)}₂=Γ₂ ⁽¹⁾−{circumflex over (Γ)}₂ ⁽¹⁾

Γ₃ ⁽²⁾=Φ₃−{circumflex over (Γ)}₃=Γ₃ ⁽¹⁾−{circumflex over (Γ)}₃ ⁽¹⁾

Γ₄ ⁽²⁾=Φ₄−{circumflex over (Γ)}₄=Γ₄ ⁽¹⁾−{circumflex over (Γ)}₄ ⁽¹⁾

Γ₅ ⁽²⁾=Φ₅−{circumflex over (Γ)}₅=Γ₅ ⁽¹⁾−{circumflex over (Γ)}₅ ⁽¹⁾

Γ₆ ⁽²⁾=Φ₆−{circumflex over (Γ)}₆=Γ₆ ⁽¹⁾−{circumflex over (Γ)}₆ ⁽¹⁾

[0023] During the process of obtaining the residue images, the brightness information, caused by the lighting system, contained in the original face image and the same brightness information contained in the reconstructed face image are counterbalanced by the subtraction. Thus, the residue images will not be influenced by the lighting system.

[0024] The present invention will be further described using general formulas.

[0025] Consider an image Φ_(i) among a collection of M images (in the above example, six images)(step 110 in FIG. 1), whereΦ_(i) is a one dimensional vector of raster-scanned image, define Ψ as the average image (step 120 in FIG. 1): $\begin{matrix} {\Psi = {\frac{1}{M}{\sum\limits_{i = 1}^{M}\Phi_{i}}}} & (1) \end{matrix}$

[0026] Every image differs from the average image by a vector rim Γ_(i) ⁽¹⁾=Φ₁−Ψ (step 130 in FIG. 1). The covariance matrix of the data is thus defined as:

Q=A ⁽¹⁾ A ⁽¹⁾ ^(T)   (2)

[0027] where A ⁽¹⁾=└Γ₁ ⁽¹⁾Γ₂ ⁽¹⁾. . . Γ_(M) ⁽¹⁾┘.

[0028] This is shown in step 140 in FIG. 1.

[0029] Note that Q has dimension wh×wh where w is the width of the image and h is the height. The size of this matrix is enormous, but since we only sum up a finite number of image vectors M, the rank of this matrix can not exceed M-1. We note that if v_(i) ⁽¹⁾is the eigenvector of A^((l)) ^(T) A⁽¹⁾(i=1,2, . . . , M) (step 150 in FIG. 1), then A⁽¹⁾ ^(T) A⁽¹⁾v_(i) ⁽¹⁾=λ_(i) ⁽¹⁾v_(i) ⁽¹⁾ where λ_(i) ⁽¹⁾ are the eigenvalue of A⁽¹⁾ ^(T) A⁽¹⁾, then A^((l)) ^(T) v_(i) ⁽¹⁾ are the eigenvectors of A⁽¹⁾A⁽¹⁾ ^(T) as we see by multiplying on the left by A⁽¹⁾ in the previous equation:

A ⁽¹⁾ A ⁽¹⁾ ^(T) A ⁽¹⁾ v _(i) ⁽¹⁾ =A ⁽¹⁾λ_(i) ⁽¹⁾ v _(i) ⁽¹⁾=λ_(i) ⁽¹⁾ A ⁽¹⁾ v _(i) ⁽¹⁾

[0030] But A^((l)) ^(T) A⁽¹⁾ ,is only of size M×M. So defining u₁ ⁽¹⁾ the eigenvector of A⁽¹⁾ A⁽¹⁾ ^(T) we have $u_{i}^{(1)} = {{A^{(1)}v_{i}^{(1)}} = {\sum\limits_{k = 1}^{M}{v_{i\quad k}^{(1)}\Gamma_{k}^{(1)}}}}$

[0031] The eigenvalue λ_(i) ⁽¹⁾ is the variance along the new coordinate space spanned by eigenvectors u_(i) ⁽¹⁾ (step 160 in FIG. 1). From here on we assume that the order of i is such that the eigenvalues λ_(i) ⁽¹⁾ are decreasing. The eigenvalues are decreasing in exponential fashion. Therefore we can project a face image Γ^((l)) onto only M ₁<<M dimensions by computing W^((l))={w_(k) ⁽¹⁾} where w_(k) ⁽¹⁾=u_(k) ⁽¹⁾ ^(T) Γ⁽¹⁾ and 1 ≦k ≦M₁·W_(k) ⁽¹⁾ is the k-th coordinate of Γ⁽¹⁾ in the new coordinate system. In this context, W^((l)) is called first -order features. The vectors u_(k) ⁽¹⁾ are actually images, and are called first-order eigenfaces (in general, it is called eigenfaces in other documents). Let U⁽¹⁾=[u₁ ₂ ⁽¹⁾. . . u₂ ⁽¹⁾. . . u_(M) ₁ ⁽¹⁾] (step 170 in FIG. 1), then

W ⁽¹⁾ =U ⁽¹⁾ ^(T) Γ⁽¹⁾   3

[0032] This is shown in step 180 in FIG. 1.

[0033]FIG. 3 shows the procedure for computing first-order features W⁽¹⁾. In the figure, eig(B, i) is the function to compute the i^(th) largest eigenvalue and its corresponding eigenvector of matrix . 320 is re-shaping, 340 is mirroring and 360 is re-shaping.

[0034] From Eq.(3), an interesting byproduct is that we can get a reconstructed matrix from W⁽¹⁾. Since U⁽¹⁾ is an M₁×P matrix, we cannot get its inverse. However, we can use its pseudo inverse to approximate its inverse. Let U⁽¹⁾ ⁺ be the pseudo-inverse of U⁽¹⁾ ^(T) , then

{circumflex over (Γ)}⁽¹⁾ =U ^((l)) ⁺ W ⁽¹⁾   (4)

[0035] where {circumflex over (Γ)}⁽¹⁾ is the reconstructed matrix from W⁽¹⁾ and U⁽¹⁾. FIG. 2 gives some original face images and their corresponding reconstructed face images with M₁=25. The top images are the reconstructed face images({circumflex over (Φ)}_(i)={circumflex over (Γ)}_(i) ⁽¹⁾+Ψ), the middle images are the corresponding original face images, and the bottom images are the residue images (Γ₁ ⁽²⁾=Γ₁ ⁽¹⁾−{circumflex over (Γ)}₁ ⁽¹⁾). From the reconstructed matrices, we can find that the details of the faces are lost. That means what W⁽¹⁾ describe can be looked as low-pass filtered images. The residue images are the corresponding high-pass filtered images. Observing the reconstructed matrices, some images cannot be reconstructed on a reasonable resolution which indicate that first -order features cannot describe these images well. The worse the reconstructed matrices is, the more information is reserved in residue image. Since these residue images still contains rich information for the individual image, face features should be extracted from these residue faces again.

[0036] Let A²=└Γ₁ ⁽²⁾Γ₂ ⁽²⁾. . . Γ_(M) ⁽²⁾┘, λ₁ ⁽²⁾ be the eigenvalues of A⁽²⁾ ^(T) A⁽²⁾ and v₁ ⁽²⁾ be the corresponding eigenvectors of A⁽²⁾ ^(T) A ⁽²⁾. Then A⁽²⁾ ^(T) A⁽²⁾ V₁ ⁽²⁾=λ_(i) ⁽²⁾. Based on the discussion above, the eigenvectors of A⁽²⁾ A⁽²⁾ ^(T) are u_(i) ²=A⁽²⁾v_(i) ²). Therefore we can project a residue face image Γ⁽²⁾ onto only M₂<<M dimensions by computing

W ⁽²⁾ ={w _(k) ⁽²⁾}, where

w _(k) ⁽²⁾ =u _(k) ⁽²⁾ ^(T) Γ⁽²⁾   (5)

[0037] and 1≦k≦M₂. Since u_(k) ⁽²⁾ are the eigenvectors of the residue face image, we call u_(k) ⁽²⁾ the second -order eigenfaces and w_(k) ⁽²⁾ the second order features.

[0038] Let U⁽²⁾=└U_(l) ⁽²⁾U₂ ⁽²⁾. . . U_(M) ₂ ² ┘, Eq.(5) can be written as $\begin{matrix} \begin{matrix} {W^{(2)} = {U^{{(2)}^{T}}\Gamma^{(2)}}} \\ {= {U^{{(2)}^{T}}\left( {\Gamma^{(1)} - {\hat{\Gamma}}^{(1)}} \right)}} \\ {= {U^{{(2)}^{T}}\left( {\Gamma^{(1)} - {U^{{(1)}^{+}}W^{(1)}}} \right)}} \\ {= {U^{{(2)}^{T}}\left( {\Gamma^{(1)} - {U^{{(1)}^{+}}U^{{(1)}^{T}}\Gamma^{(1)}}} \right)}} \\ {= {\left( {U^{{(2)}^{T}} - {U^{{(2)}^{T}}U^{{(1)}^{+}}U^{{(1)}^{T}}}} \right)\Gamma^{(1)}}} \end{matrix} & (6) \end{matrix}$

[0039] Let U₂=(U⁽²⁾ ^(T) −U⁽²⁾ ^(T) U⁽¹⁾ ^(+U) ⁽¹⁾ ^(T) )^(T) then

W ⁽²⁾ =U ₂ ^(T)Γ⁽¹⁾   (7)

[0040] Since U₂ is a constant transform matrix and it is just calculated once, it will not effect the efficiency of computation. The face images can be described with Ω(Φ)=[w₁ ⁽¹⁾, w₂ ⁽¹⁾, . . . , w_(M) ₁ ⁽¹⁾, w₁ ², . . . , w_(m) ₂ ⁽²⁾]^(T), where 1≦M₁ ¹≦M₁. The computational burden does not increase in computing Ω(Φ) compared with only computing features from eigenfaces U. For the convenience of discussion, the residue images are called second Order residue image and the original face images are called first order residue images (though it seems it is better to call the original images as 0^(th) -order residue images).

[0041] The first-order eigenfeatures describe the characteristics of original images and the second-order eigenfeatures depict the characteristics of high-passed images. These characteristics can be used for different applications.

[0042] In lighting-invariant case, the view-angles of the images are almost the same, but, the lighting conditions are different. The light can come from left, right, or both. Also the faces can be light or dark. In this situation, the features of images should be extracted after filtering. The original face image contains data of lighting feature, and the first-order eigenfeature also contains data of lighting feature. That means the first-order eigenfeatures are not suitable in this case. he second-order eigenfeature is obtained by subtracting the first-order eigenfeature from the original face image, thus removing the data of lighting feature. Thus, the second-order eigenfeatures have no influence by the lighting, and are suitable for use in face recognition that does not influenced by the lighting. On the other hand, when we consider view-angle-invariant case, the images of the same person are taken under the almost the same lighting condition but the view-angles or poses are not the same. In this situation, both the first-order and second-order eigenfeatures are important to describe the faces.

[0043] The first-order eigenfeature is obtained by processing the original face image through a low pass filter to extract, not the detail, but general feature of the face. Thus the first-order eigenfeature can provide approximately the same feature even if face images are obtained in different view-angles. Thus, in the cases where the view-angles may change, the first-order eigenfeature is used in addition to the second-order eigenfeature so as to obtain features which will not be influenced by the view-angle.

[0044] Therefore we will use second-order eigenfeatures as face descriptor to describe lighting-invariant situation and both of the first-order and second-order eigenfeatures as face descriptor to describe view-angle-invariant situation.

[0045] When we consider face description, an important characteristic is symmetry of faces. The faces of most of the people are symmetric. Thus we can consider to use the mirrored face image to represent the same person. Thus the eigenfeatures of the original image and the mirrored image can both represent the same person. Therefore, we can use the linear combination of the eigenfeatures of the two images to represent the original image. In order to discriminate between the original image and the mirrored image, different weights can be used to calculate features.

[0046] Suppose Φ be the original image and Φ′ be the mirrored image of Φ.

[0047] Then the adjusted eigenfeature should be

{overscore (w)} _(i) ⁽¹⁾(Φ)=w _(i) ⁽¹⁾(Φ)+c·w _(i) ⁽¹⁾(101 ′)

[0048] and

{overscore (w)} ₁ ⁽²⁾(Φ)=w ₁ ⁽²⁾(Φ)+c·w _(i) ⁽²⁾(Φ′)

[0049] where 0 <c <1 is the weight for adjustment. In order to simplify the computation, the computational order can be rearranged.

[0050] Since w₁ ⁽¹⁾(Φ′)=u₁ ⁽¹⁾ ^(T) Γ′⁽¹⁾=u₁ ⁽¹⁾ ^(T) Γ⁽¹⁾, $\begin{matrix} {{{\overset{\_}{w}}_{i}^{(1)}(\Phi)} = {{w_{i}^{(1)}(\Phi)} + {c \cdot {w_{i}^{(1)}\left( \Phi^{\prime} \right)}}}} \\ {= {{u_{i}^{{(1)}^{T}}\Gamma^{(1)}} + {{c \cdot u_{i}^{{(1)}^{\prime \quad T}}}\Gamma^{(1)}}}} \\ {= {\left( {u_{i}^{{(1)}^{T}} + {c \cdot u_{i}^{{(1)}^{\prime \quad T}}}} \right)\Gamma^{(1)}}} \end{matrix}$

[0051] where u ₁ ⁽¹⁾ ^(T) is the mirrored eigenface of U₁ ⁽¹⁾ ^(T) . FIG. 1 shows the procedure to get u₁ ⁽¹⁾ ^(T) , from u₁ ⁽¹⁾ ^(T) . With the same method, we can obtain $\begin{matrix} \begin{matrix} {{\overset{\_}{W}}^{(1)} = {{U^{{(1)}^{T}}\Gamma^{(1)}} + {{c \cdot U^{{(1)}^{T}}}{{flip}\left( \Gamma^{(1)} \right)}}}} \\ {= {{U^{{(1)}^{T}}\Gamma^{(1)}} + {{c \cdot {{flip}\left( U^{{(1)}^{T}} \right)}}\Gamma^{(1)}}}} \\ {= {\left( {U^{{(1)}^{T}} + {c \cdot {{flip}\left( U^{{(1)}^{T}} \right)}}} \right)\Gamma^{(1)}}} \\ {= {{\overset{\_}{U}}_{1}\Gamma^{(1)}}} \end{matrix} & (8) \end{matrix}$

$\begin{matrix} \begin{matrix} {{\overset{\_}{W}}^{(2)} = {{U_{2}^{T}\Gamma^{(1)}} + {{c \cdot U_{2}^{T}}{{flip}\left( \Gamma^{(1)} \right)}}}} \\ {= {{U_{2}^{T}\Gamma^{(1)}} + {{c \cdot {{flip}\left( U_{2}^{T} \right)}}\Gamma^{(1)}}}} \\ {= {\left( {U_{2}^{T} + {c \cdot {{flip}\left( U_{2}^{T} \right)}}} \right)\Gamma^{(1)}}} \\ {= {{\overset{\_}{U}}_{2}\Gamma^{(1)}}} \end{matrix} & (9) \end{matrix}$

[0052] where mirror() is the mirror function to mirror matrix in left/right direction. With Eq.(8) and Eq.(9), the first-order eigenfaces and second-order eigenfaces and can be adjusted to {overscore (U)}₁ and {overscore (U)}₂.

[0053] The eigenfeatures discussed above can be used to describe huma faces effectively. However, if the eigenfeatures are looked as features for face recognition or related application, the eigenfeatures should be normalized since the range of the eigenfeatures are not the same.

[0054] One of the reasonable normalization method is to divide the eigenfeatures by the corresponding standard deviation of eigenfeatures in the training set. Let σ_(i) ^((J)) be the standard deviation of w_(i) ^((J)) in the training set, where j=1,2 denotes the first- or second-order eigenfeatures. Then normalized eigenfeatures of image Φ are ${{\overset{\sim}{w}}_{i}^{(j)}(\Phi)} = \frac{{\overset{\_}{w}}_{i}^{(j)}(\Phi)}{\sigma_{i}^{(j)}}$

[0055] The similarity of face images is simply defined as the weighted distance between normalized projections: $\begin{matrix} {{\delta \left( {\Phi_{1},\Phi_{2}} \right)} = {\sum\limits_{i = 1}^{M_{1}^{\prime}}\left. ||{a_{i}^{(1)}\left( {{{\overset{\sim}{w}}_{i}^{(1)}\left( \Phi_{1} \right)} - {{\overset{\sim}{w}}_{i}^{(1)}\left( \Phi_{2} \right)}} \right)}||{+ \sum\limits_{j = 1}^{M_{2}}}||{a_{j}^{(2)}\left( {{{\overset{\sim}{w}}_{j}^{(2)}\left( \Phi_{1} \right)} - {{\overset{\sim}{w}}_{j}^{(2)}\left( \Phi_{2} \right)}} \right)} \right.||}} & (10) \end{matrix}$

[0056] If a₁ ⁽¹⁾⁼0₂, the similarity of face images will be measured only with second-order eigenfeatures for lighting-invariant face description. For view-angle-invariant case, both first- and second-order eigenfeatures are necessary. The weights are chosen as follows: $a_{i}^{(1)} = {{{{round}\left( \frac{\sqrt{\sigma_{i}^{(1)}}}{100} \right)}\quad {and}\quad a_{j}^{(2)}} = {{round}\left( \frac{\sqrt{\sigma_{j}^{(2)}}}{100} \right)}}$

[0057] The weights can also select other numbers according the applications. In fact, the weights can be embedded into adjusted eigenfaces to reduce the computation, and the normalization parameters can also been moved to eigenface matrix. In order to save the storage, the eigenface matrix and eigenfeatures should be quantized into integers from floating points. ${{{Let}\quad {\hat{u}}_{i}^{(j)}} = {{Round}\left( {a_{i}^{(j)}\frac{u_{i}^{(j)}}{\sigma_{i}^{(j)}}R^{(j)}} \right)}},{{{where}\quad R^{(j)}} = \frac{128}{\max\limits_{i}\left( {{abs}\left( {a_{i}^{(j)}\frac{u_{i}^{(j)}}{\sigma_{i}^{(j)}}} \right)} \right)}},$

[0058] and Round () is the round function, and j=1, 2. The eigenfeatures can be quantized with $\begin{matrix} {{{\overset{\Cap}{w}}_{i}^{(j)}(\Phi)} = \left\{ {\begin{matrix} {\quad {{- 128},}} & {if} & {{{Round}\left( {d^{(j)}{\overset{\Cap}{u}}_{i}^{(j)}\Gamma^{(1)}} \right)} < {- 128}} \\ {\quad {127,}} & {if} & {{{Round}\left( {d^{(j)}{\overset{\Cap}{u}}_{i}^{(j)}\Gamma^{(1)}} \right)} > 127} \\ {\quad {{{Round}\left( {d^{(j)}{\overset{\Cap}{u}}_{i}^{(j)}\Gamma^{(1)}} \right)},}} & \quad & {otherwise} \end{matrix},} \right.} & \left( {10\text{-}1} \right) \end{matrix}$

[0059] where ${d^{(j)} = \frac{128}{\max\limits_{i,k}{\left( {{abs}\left( {\frac{{\overset{\Cap}{u}}_{i}^{(j)}}{R^{(j)}}\Gamma_{k}} \right)} \right)R^{(j)}}}},$

[0060] Γ_(k) is the images in the training set. The feature set can be written as Ŵ⁽¹⁾ = {Ŵ_(i)⁽¹⁾}  and  Ŵ⁽²⁾ = {Ŵ_(j)⁽²⁾}.

[0061] Therefore, each eigenfeature can be quantized to 8 bits.

[0062] Further in order to reduce the size of total eigenfeatures, the eigenfeatures can be re-quantized according to their standard deviation of the training set. This can be considered as the trade-off between the size of face descriptor and the retrieval accuracy. According to our experiments, the bits for each eigenfeature can be allocated as follows: $N_{i}^{(j)} = {{round}\left( {\log_{2}\left( {\frac{\sigma_{i}^{(j)}}{\min \left( \sigma^{(j)} \right)} \times 16} \right)} \right)}$

[0063] where min(σ^((J))) is the minimum of the standard deviations of the j-th order eigenfeatures. Though different eigenfeature allocate different bits, the range is still remains [−128, 127 ] With this quantization strategy, the size of face descriptor can reduce about 40% while the retrieval accuracy drop about 1% to 2%. If the original quantization strategy is acceptable, then the further quantization is not necessary. Here a normalizing and clipping procedure example is given to further quantize and compact the feature from the equation (10-1) and each eigenfeature can be represented as unified 5 bits: ${\overset{\Cap}{w}}_{i} = \left\{ \begin{matrix} {0,} & {if} & {{{\overset{\Cap}{w}}_{i}/Z} < {- 16}} \\ {31,} & {if} & {{{\overset{\Cap}{w}}_{i}/Z} > 15} \\ {{{round}\left( {{w_{i}/Z} + 16} \right)},} & \quad & {otherwise} \end{matrix} \right.$

[0064] where Z=16384*8 is the normalization constant from our experience. With the above formulae, the distance between two face images Φ₁, Φ₂ for view-angle-invariant description, can be calculated as $\begin{matrix} {{\delta \left( {\Phi_{1},\Phi_{2}} \right)} = {\sum\limits_{i = 1}^{M_{1}^{\prime}}\left. ||{{{\overset{\Cap}{w}}_{i}^{(1)}\left( \Phi_{1} \right)} - {{\overset{\Cap}{w}}_{i}^{(1)}\left( \Phi_{2} \right)}}||{+ \sum\limits_{j = 1}^{M_{2}}}||{{{\overset{\Cap}{w}}_{j}^{(2)}\left( \Phi_{1} \right)} - {{\overset{\Cap}{w}}_{j}^{(2)}\left( \Phi_{2} \right)}} \right.||}} & (11) \end{matrix}$

[0065] and the distance distance between two face images Φ, Φ₂ for lighting-invariant description, can be calculated as $\begin{matrix} {{\delta \left( {\Phi_{1},\Phi_{2}} \right)} = {\sum\limits_{j = 1}^{M_{2}}\left. ||{{{\overset{\Cap}{w}}_{j}^{(2)}\left( \Phi_{1} \right)} - {{\overset{\Cap}{w}}_{j}^{(2)}\left( \Phi_{2} \right)}} \right.||}} & (12) \end{matrix}$

[0066] In order to further compact the face descriptor, variable length coding can be used to the quantized eigenfeatures. The Huffman coding and arithmetic coding can be used to do the work.

[0067] The code tables can be computed as follows:

[0068] 1) for the images in the training set, calculating the eigenfeatures;

[0069] 2) quantizing the eigenfeatures with the stretegy discussed above;

[0070] 3) for the quantized eigenfeatures with the same bit allocation, computing the probability of each quantization level;

[0071] 4) calculating the variable length codes for all quantization levels;

[0072] 5) calculating all code tables with the steps 3) and 4) for all bit allocation cases.

[0073] With this method, the face descriptor can be further compacted. Correspondingly, The coded face descriptor should be decoded before the distance between two face descriptors can be calculated.

[0074] According to our observation, the first-order eigenfeatures itself can also be used to describe view-angle- and lighting-invariant face features. The view-angle-invariant face features can be the eigenfeatures extracted from the eigenfaces corresponding to the top N largest eigenvalues. The lighting-invariant face features can be the eigenfeatures extracted from the eigenfaces corresponding to the top k-th to N-th largest eigenvalues where 0<k<N. In general, 4≦k≦10 and 40 ≦N≦60. We recommend the use of k=8, N=40 and total eigenface number is 48. FIG. 4 and FIG. 5 show, respectively, a flow chart for extracting eigenfeatures that will not be influenced by the lighting, and a flow chart for extracting eigenfeature that will not be influenced by the view-angle.

[0075] In FIG. 4 showing the method of extracting eigenfeatures that will not be influenced by the lighting, the following steps are provided.

[0076] Step 410: Calculate the adjusted second -order eigenface matrix.

[0077] Step 420: Get the adjusted second -order engenfeatures.

[0078] Step 430: Select features to describe faces from the adjusted second -order eigenfeatures.

[0079] Step 440: Code the quantized eigenfeatures with VLC. This step can be omitted.

[0080] In FIG. 5 showing the method of extracting eigenfeature that will not be influenced by the view-angle, the following steps are provided.

[0081] Step 510: Calculate the adjusted first -order eigenface matrix.

[0082] Step 520: Calculate the adjusted second -order eigenface matrix.

[0083] Step 530: Get the adjusted first-order eigenfeatures.

[0084] Step 540: Get the adjusted second-order eigenfeatures.

[0085] Step 550: Quantize the adjusted first-order eigenfeatures and the adjusted second-order eigenfeatures.

[0086] Step 560: Select features to describe faces from the adjusted first-order and second-order eigenfeatures.

[0087] Step 570: Code the quantized eigenfeatures with VLC. This step can be omitted.

[0088] This invention is very effective for describing human faces. Since the second-order eigenfaces can be calculated only once with the training face images, the second-order features can be obtained as efficient as first-order features. Since detailed information can be revealed with high-order eigenfeatures, the performance of the combination of first-order and second-order eigenfeatures is better in view-angle-invariant face description compared with the same number of first-order eigenfeatures. The second-order eigenfeatures has much better lighting-invariant face description capability compared with the first-order eigenfeatures. This invention is very effective and efficient in describing human faces. The description method can be used in internet multimedia database retrieval, video editing, digital library, surveillance and tracking, and other applications using face recognition and verification broadly.

[0089] The present disclosure relates to subject matter contained in priority Japanese Patent Application No. 2000-385126, filed on Dec. 19, 2000, the contents of which is herein expressly incorporated by reference in its entirety. 

WHAT IS CLAIMED IS
 1. A method of extracting features for lighting-invariant face description, comprising the steps of: getting adjusted second -order eigenfeatures of a face image; quantizing said adjusted second-order eigenfeatures; and selecting features to construct face descriptor to describe faces from the said quantized second -order eigenfeatures.
 2. A method of extracting features for lighting-invariant face description, comprising the steps of: getting adjusted second -order eigenfeatures of a face image; quantizing said adjusted second-order eigenfeatures; selecting features to construct face descriptor to describe faces from the said quantized second -order eigenfeatures; and coding said selected eigenfeatures in the lighting-invariant face descriptor.
 3. A method of extracting features for view-angle-invariant face description, comprising the steps of: getting adjusted first -order eigenfeatures of a face image; getting adjusted second -order eigenfeatures of a face image; quantizing said adjusted first -order eigenfeatures; quantizing said adjusted second -order eigenfeatures; and selecting features to construct face descriptor to describe faces from said quantized first-order and second -order eigenfeatures.
 4. A method of extracting features for view-angle-invariant face description, comprising the steps of: getting adjusted first -order eigenfeatures; getting adjusted second -order eigenfeatures; quantizing said adjusted first -order eigenfeatures; quantizing said adjusted second -order eigenfeatures; selecting features to construct face descriptor to describe faces from said quantized first-order and second -order eigenfeatures; and coding said selected eigenfeatures in the view-angle-invariant face descriptor.
 5. A method in claim I of getting adjusted second-order eigenfeatures of a face image, comprising the step of. getting the dot product of the face image and an adjusted second-order eigenface matrix.
 6. A method in claim 3 of getting adjusted first-order eigenfeatures of a face image, comprising the step of: getting the dot product of the face image and an adjusted first-order eigenface matrix.
 7. A method of computing said adjusted first-order eigenface matrix in claim 6, comprising the steps of: calculating a first -order eigenface matrix; and adjusting said first-order eigenface matrix.
 8. A method of computing said adjusted second-order eigenface matrix in claim 5, comprising the steps of: calculating a second -order eigenface matrix; and adjusting said second-order eigenface matrix.
 9. A method in claim 7 of adjusting the said first-order eigenfaces, comprising the steps of: getting the first-order eigenfeatures of the training face images; arranging the first-order eigenface as a two dimensional array of the original images; getting the mirrored eigenface of said two dimensional array; weighting said mirrored eigenface image; adding said weighted eigenface image to the said first-order eigenface; re-arranging the first-order eigenface to obtain the one-dimensional adjusted first-order eigenface; normalizing the adjusted first-order eigenfaces; getting the weights of the adjusted first-order eigenfeatures for distance computation; multiplying the weights of the first-order eigenfeatures for distance computation to the adjusted first-order eigenface matrix; and quantizing the first-order eigenface matrix.
 10. A method in claim 8 of calculating the second -order eigenfaces, comprising the steps of: calculating a first-order eigenface matrix; getting first-order eigenfeatures from the training face images; calculating a pseudo-inverse of said first -order eigenface matrix; calculating the first-order reconstructed face images by multiplying the said first-order eigenfeatures to the said pseudo-inverse of the first-order eigenface matrix; getting second -order residue images by subtracting the first-order reconstructed face images from the original images; and getting the second-order eigenfaces by calculating the eigenvectors of said second -order residue images.
 11. A method in claim 8 of adjusting the second -order eigenfaces, comprising the steps of. getting the second-order eigenfeatures of the training images by computing the dot products of the face images and the second-order eigenfaces; re-shaping the second-order eigenfaces to the original image shape and getting the left-right mirrored eigenface images; weighting the mirrored eigenface images and adding them to the corresponding original image shaped second-order eigenface images; re-arranging the original image shaped second-order eigenfaces to obtain the one-dimensional adjusted second-order eigenfaces; normalizing the adjusted second-order eigenfaces; getting the weights of second-order eigenfeatures for distance computation; multiplying the weights of second-order eigenfeatures for distance computation to the adjusted second-order eigenface matrix; and quantizing the second-order eigenface matrix.
 12. A method in claim 9 of quantizing the adjusted first-order eigenface matrix, comprising the steps of: getting the maximum and the minimum of the adjusted first-order eigenface matrix; getting the quantization step by dividing the interval between said maximum and said minimum into a plurality of quantization levels; dividing said adjusted first-order eigenface matrix with said quantization step; and rounding said divided values to the nearest integers.
 13. A method in claim 11 of quantizing the adjusted second-order eigenface matrix, comprising the steps of: getting the maximum and the minimum of said adjusted second-order eigenface matrix; getting the quantization step by dividing the interval between said maximum and said minimum into a plurality of quantization levels; dividing said adjusted second-order eigenface matrix with said quantization step; and rounding said divided values to the nearest integers.
 14. A method in claim I of getting the adjusted second-order eigenfeatures, comprising the steps of: getting the recovered adjusted second-order eigenface by multiplying the said quantized second-order eigenface matrix with the said quantization step in the claim 11; and getting the second-order eigenfeatures by multiplying each column-wise recovered adjusted second-order eigenface with the row-wise face image;
 15. A method in claim 3 of getting the adjusted first-order eigenfeatures, comprising the steps of: getting the recovered adjusted first-order eigenface by multiplying the said quantized first-order eigenface matrix with the said quantization step in the claim 12; and getting the first-order eigenfeatures by multiplying each column-wise recovered adjusted first-order eigenface with the row-wise face image.
 16. A method in claim I of quantizing the adjusted second-order eigenfeatures, comprising of the steps of: getting the maximum and the minimum of said adjusted second-order eigenfeatures of the training images; getting the quantization step by dividing the interval between said maximum and said minimum into a plurality of quantization levels; dividing said adjusted second-order eigenfeatures with said quantization step; and rounding said divided values to the nearest integers.
 17. A method in claim 1 of quantizing the adjusted second-order eigenfeatures, comprising of the steps of: getting the maximum and the minimum of said adjusted second-order eigenfeatures of the training images; getting the quantization step by dividing the interval between said maximum and said minimum into a plurality of quantization levels; dividing said adjusted second-order eigenfeatures with said quantization step; rounding said divided values to the nearest integers; allocating different number of bits to different eigenfeatures by computing the rounded logarithm of the standard deviation of the corresponding eigenfeatures in the training set divided by minimum of the standard deviations; and quantizing said eigenfeatures according to the corresponding bit allocation.
 18. A method in claim 3 of quantizing the adjusted first-order eigenfeatures, comprising of the steps of: getting the maximum and the minimum of the adjusted first-order eigenfeatures of the training images; getting the quantization step by dividing the interval between said maximum and said minimum into a plurality of quantization levels; dividing said adjusted first-order eigenfeatures with said quantization step; and rounding said divided values to the nearest integers;
 19. A method in claim 3 of quantizing the adjusted first-order eigenfeatures, comprising of the steps of: getting the maximum and the minimum of the adjusted first-order eigenfeatures of the training images; getting the quantization step by dividing the interval between said maximum and said minimum into a plurality of quantization levels; dividing said adjusted first-order eigenfeatures with said quantization step; rounding said divided values to the nearest integers; allocating different number of bits to different eigenfeatures by computing the rounded logarithm of the standard deviation of the corresponding eigenfeatures in the training set divided by minimum of the standard deviations; and quantizing said eigenfeatures according to the corresponding bit allocation.
 20. A method in claim 9 of getting the weights of the adjusted first-order eigenfeatures for distance computation, comprising the steps of: getting the standard deviations of said adjusted first-order eigenfeatures of the training face images; and getting the weights by extracting the square roots of said standard deviations.
 21. A method in claim 11 of getting the weights of the adjusted second-order eigenfeatures for distance computation, comprising the steps of: getting the variances of said adjusted second-order eigenfeatures of the training face images; and getting the weights of the adjusted second-order eigenfeatures by extracting the square roots of said variances.
 22. A method of measuring lighting-invariant similarity between faces, comprising the steps of: extracting the eigenfeatures of the faces for lighting-invariant face description with the method described in claims 1 and 2; getting the Euclidean distances of said eigenfeatures of the faces; and choosing the smallest Euclidean distance to indicate the best matching pair of faces.
 23. A method of measuring view-angle-invariant similarity between faces, comprising the steps of: extracting the eigenfeatures of the faces for view-angle-invariant face description with the method described in claims 3 and 4; and getting the Euclidean distances of the features of the faces; and choosing the smallest Euclidean distance to indicate the best matching pair of faces.
 24. A method of getting code tables of variable length coding (VLC) for light-invariant face descriptor, comprising the steps of: getting the said quantized eigenfeatures of the training set with the method described in claim 1; classifying said eigenfeatures in to groups depending on the bit allocations; constructing a code table for each of the said group of eigenfeatures with the same bit allocation, using an entropy coding method.
 25. A method of getting code tables of variable length coding (VLC) for view-angle-invariant face descriptor, comprising the steps of: getting the said quantized eigenfeatures of the training set with the method described in claim 3; classifying said eigenfeatures in to groups depending on the bit allocations; constructing a code table for each of the said group of eigenfeatures with the same bit allocation, using an entropy coding method.
 26. A method of constructing a code table in claim 24 where the entropy coding method is a Huffinan coding method based on the probability of the quantization level.
 27. A method of constructing a code table in claim 24 where the entropy coding method is an Arithmetic coding method based on the probability of the quantization level.
 28. A method in claim 1 of coding lighting-invariant face descriptor, comprising the step of: looking up the code table generated with the method described in claim 24 for each quantized eigenfeature and using the corresponding code word to represent said quantized eigenfeature.
 29. A method in claim 3 of coding view-angle-invariant face descriptor, comprising the step of: looking up the code table generated with the method described in claim 25 for each quantized eigenfeature and using the corresponding code word to represent said quantized eigenfeature.
 30. A method of extracting features for general face description, comprising the steps of: getting adjusted first-order eigenfeatures of a face image with the method in the claim 7; quantizing said adjusted first-order eigenfeatures with the method in the claim 19; and selecting features to construct face descriptor to describe faces from the said quantized first-order eigenfeatures.
 31. A method of extracting features for general face description, comprising the steps of: getting adjusted first-order eigenfeatures of a face image with the method in the claim 7; quantizing said adjusted first-order eigenfeatures with the method in the claim 19; selecting features to construct face descriptor to describe faces from the said quantized first-order eigenfeatures; and coding said selected eigenfeatures in the face descriptor.
 32. A method in the claim 30 of selecting features to construct face descriptor to describe faces from the said quantized first-order eigenfeatures, comprising the step of: The eigenfeatures corresponding to the top N largest eigenvalues are selected for view-angle invariant face description.
 33. A method in the claim 30 of selecting features to construct face descriptor to describe faces from the said quantized first-order eigenfeatures, comprising the step of: The eigenfeatures corresponding to the k-th to N-th largest eigenvalues (0<k<N) are selected for lighting-invariant face description. 